./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-6.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_floatingpointinfluence_no-floats_file-6.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', '39503444fac790cc7ef077fbcc4f712a5a3d8e4f2da830986fe4863c2c197175'] 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_floatingpointinfluence_no-floats_file-6.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 39503444fac790cc7ef077fbcc4f712a5a3d8e4f2da830986fe4863c2c197175 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:49:57,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:49:57,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:49:57,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:49:57,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:49:57,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:49:57,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:49:57,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:49:57,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:49:57,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:49:57,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:49:57,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:49:57,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:49:57,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:49:57,468 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:49:57,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:49:57,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:49:57,468 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:49:57,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:49:57,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:49:57,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:49:57,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:49:57,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:49:57,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:49:57,469 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:49:57,469 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:49:57,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:49:57,469 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:49:57,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:49:57,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:49:57,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:49:57,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:49:57,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:49:57,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:49:57,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:49:57,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:49:57,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:49:57,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:49:57,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:49:57,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:49:57,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:49:57,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:49:57,471 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 -> 39503444fac790cc7ef077fbcc4f712a5a3d8e4f2da830986fe4863c2c197175 [2024-11-07 07:49:57,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:49:57,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:49:57,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:49:57,727 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:49:57,727 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:49:57,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-6.i [2024-11-07 07:49:58,806 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:49:59,007 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:49:59,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-6.i [2024-11-07 07:49:59,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38fb96fab/cb7a5fcd4d694d03ab22f7f509ed5b53/FLAG9166d9998 [2024-11-07 07:49:59,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38fb96fab/cb7a5fcd4d694d03ab22f7f509ed5b53 [2024-11-07 07:49:59,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:49:59,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:49:59,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:49:59,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:49:59,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:49:59,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:49:59" (1/1) ... [2024-11-07 07:49:59,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7614da4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59, skipping insertion in model container [2024-11-07 07:49:59,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:49:59" (1/1) ... [2024-11-07 07:49:59,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:49:59,493 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_floatingpointinfluence_no-floats_file-6.i[915,928] [2024-11-07 07:49:59,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:49:59,537 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:49:59,545 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_floatingpointinfluence_no-floats_file-6.i[915,928] [2024-11-07 07:49:59,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:49:59,581 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:49:59,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59 WrapperNode [2024-11-07 07:49:59,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:49:59,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:49:59,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:49:59,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:49:59,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59" (1/1) ... [2024-11-07 07:49:59,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59" (1/1) ... [2024-11-07 07:49:59,627 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-07 07:49:59,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:49:59,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:49:59,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:49:59,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:49:59,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59" (1/1) ... [2024-11-07 07:49:59,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59" (1/1) ... [2024-11-07 07:49:59,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59" (1/1) ... [2024-11-07 07:49:59,659 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:49:59,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59" (1/1) ... [2024-11-07 07:49:59,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59" (1/1) ... [2024-11-07 07:49:59,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59" (1/1) ... [2024-11-07 07:49:59,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59" (1/1) ... [2024-11-07 07:49:59,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59" (1/1) ... [2024-11-07 07:49:59,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59" (1/1) ... [2024-11-07 07:49:59,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:49:59,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:49:59,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:49:59,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:49:59,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59" (1/1) ... [2024-11-07 07:49:59,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:49:59,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:49:59,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:49:59,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:49:59,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:49:59,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:49:59,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:49:59,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:49:59,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:49:59,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:49:59,788 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:49:59,789 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:49:59,973 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 07:49:59,974 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:49:59,980 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:49:59,980 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:49:59,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:49:59 BoogieIcfgContainer [2024-11-07 07:49:59,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:49:59,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:49:59,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:49:59,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:49:59,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:49:59" (1/3) ... [2024-11-07 07:49:59,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd4c845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:49:59, skipping insertion in model container [2024-11-07 07:49:59,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:59" (2/3) ... [2024-11-07 07:49:59,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd4c845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:49:59, skipping insertion in model container [2024-11-07 07:49:59,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:49:59" (3/3) ... [2024-11-07 07:49:59,988 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-6.i [2024-11-07 07:49:59,998 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:49:59,998 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:50:00,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:50:00,044 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;@698930f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:50:00,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:50:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 07:50:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 07:50:00,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:50:00,057 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:50:00,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:50:00,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:50:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1262268394, now seen corresponding path program 1 times [2024-11-07 07:50:00,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:50:00,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249575291] [2024-11-07 07:50:00,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:50:00,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:50:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:50:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:50:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:50:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:50:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:50:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:50:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:50:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:50:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:50:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:50:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:50:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:50:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:50:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:50:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:50:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:50:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 07:50:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:50:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 07:50:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:50:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 07:50:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:50:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:50:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 07:50:00,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:50:00,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249575291] [2024-11-07 07:50:00,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249575291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:50:00,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:50:00,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:50:00,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844680299] [2024-11-07 07:50:00,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:50:00,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:50:00,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:50:00,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:50:00,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:50:00,384 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 07:50:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:50:00,410 INFO L93 Difference]: Finished difference Result 113 states and 199 transitions. [2024-11-07 07:50:00,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:50:00,411 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 140 [2024-11-07 07:50:00,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:50:00,417 INFO L225 Difference]: With dead ends: 113 [2024-11-07 07:50:00,417 INFO L226 Difference]: Without dead ends: 56 [2024-11-07 07:50:00,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:50:00,424 INFO L432 NwaCegarLoop]: 84 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, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:50:00,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:50:00,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-07 07:50:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-07 07:50:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 07:50:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2024-11-07 07:50:00,463 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 140 [2024-11-07 07:50:00,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:50:00,464 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2024-11-07 07:50:00,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 07:50:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2024-11-07 07:50:00,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 07:50:00,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:50:00,466 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:50:00,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:50:00,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:50:00,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:50:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1944451116, now seen corresponding path program 1 times [2024-11-07 07:50:00,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:50:00,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528805106] [2024-11-07 07:50:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:50:00,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:50:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:50:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:50:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:50:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:50:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:50:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:50:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:50:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:50:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:50:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:50:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:50:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:50:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:50:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:50:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:50:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:50:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 07:50:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:50:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 07:50:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:50:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 07:50:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:50:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:50:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 07:50:00,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:50:00,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528805106] [2024-11-07 07:50:00,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528805106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:50:00,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:50:00,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:50:00,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585296393] [2024-11-07 07:50:00,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:50:00,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:50:00,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:50:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:50:00,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:50:00,937 INFO L87 Difference]: Start difference. First operand 56 states and 84 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:00,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:50:00,989 INFO L93 Difference]: Finished difference Result 148 states and 222 transitions. [2024-11-07 07:50:00,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:50:00,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-11-07 07:50:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:50:00,992 INFO L225 Difference]: With dead ends: 148 [2024-11-07 07:50:00,992 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 07:50:00,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:50:00,996 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 55 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:50:00,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:50:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 07:50:01,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-11-07 07:50:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 07:50:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 138 transitions. [2024-11-07 07:50:01,021 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 138 transitions. Word has length 140 [2024-11-07 07:50:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:50:01,021 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 138 transitions. [2024-11-07 07:50:01,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 138 transitions. [2024-11-07 07:50:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 07:50:01,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:50:01,025 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:50:01,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:50:01,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:50:01,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:50:01,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1135104490, now seen corresponding path program 1 times [2024-11-07 07:50:01,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:50:01,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522902737] [2024-11-07 07:50:01,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:50:01,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:50:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:50:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:50:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:50:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:50:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:50:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:50:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:50:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:50:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:50:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:50:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:50:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:50:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:50:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:50:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:50:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:50:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 07:50:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:50:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 07:50:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:50:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 07:50:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:50:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:50:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:01,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 07:50:01,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:50:01,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522902737] [2024-11-07 07:50:01,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522902737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:50:01,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:50:01,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:50:01,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272897345] [2024-11-07 07:50:01,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:50:01,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:50:01,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:50:01,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:50:01,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:50:01,487 INFO L87 Difference]: Start difference. First operand 92 states and 138 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:50:01,648 INFO L93 Difference]: Finished difference Result 181 states and 273 transitions. [2024-11-07 07:50:01,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:50:01,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-11-07 07:50:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:50:01,653 INFO L225 Difference]: With dead ends: 181 [2024-11-07 07:50:01,654 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 07:50:01,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:50:01,656 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:50:01,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 80 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:50:01,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 07:50:01,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 07:50:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 07:50:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2024-11-07 07:50:01,674 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 140 [2024-11-07 07:50:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:50:01,675 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2024-11-07 07:50:01,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2024-11-07 07:50:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 07:50:01,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:50:01,679 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:50:01,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:50:01,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:50:01,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:50:01,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1384855444, now seen corresponding path program 1 times [2024-11-07 07:50:01,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:50:01,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592059061] [2024-11-07 07:50:01,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:50:01,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:50:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:50:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:50:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:50:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:50:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:50:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:50:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:50:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:50:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:50:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:50:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:50:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:50:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:50:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:50:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:50:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:50:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 07:50:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:50:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 07:50:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:50:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 07:50:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:50:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:50:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 07:50:06,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:50:06,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592059061] [2024-11-07 07:50:06,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592059061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:50:06,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:50:06,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:50:06,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292165726] [2024-11-07 07:50:06,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:50:06,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:50:06,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:50:06,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:50:06,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:50:06,212 INFO L87 Difference]: Start difference. First operand 92 states and 136 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:50:07,052 INFO L93 Difference]: Finished difference Result 102 states and 145 transitions. [2024-11-07 07:50:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:50:07,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-11-07 07:50:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:50:07,054 INFO L225 Difference]: With dead ends: 102 [2024-11-07 07:50:07,054 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 07:50:07,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:50:07,055 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 41 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:50:07,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 292 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:50:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 07:50:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-11-07 07:50:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 55 states have internal predecessors, (63), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 07:50:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 139 transitions. [2024-11-07 07:50:07,071 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 139 transitions. Word has length 140 [2024-11-07 07:50:07,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:50:07,072 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 139 transitions. [2024-11-07 07:50:07,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 139 transitions. [2024-11-07 07:50:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 07:50:07,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:50:07,073 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:50:07,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:50:07,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:50:07,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:50:07,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1143973856, now seen corresponding path program 1 times [2024-11-07 07:50:07,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:50:07,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325792233] [2024-11-07 07:50:07,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:50:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:50:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:08,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:50:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:50:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:50:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:50:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:50:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:50:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:50:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:50:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:50:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:50:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:50:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:50:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:50:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:50:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:50:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:50:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 07:50:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:50:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 07:50:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:50:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 07:50:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:50:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:50:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 07:50:09,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:50:09,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325792233] [2024-11-07 07:50:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325792233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:50:09,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:50:09,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 07:50:09,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228997006] [2024-11-07 07:50:09,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:50:09,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 07:50:09,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:50:09,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 07:50:09,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:50:09,053 INFO L87 Difference]: Start difference. First operand 95 states and 139 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:50:09,644 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2024-11-07 07:50:09,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 07:50:09,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2024-11-07 07:50:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:50:09,649 INFO L225 Difference]: With dead ends: 116 [2024-11-07 07:50:09,649 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 07:50:09,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-07 07:50:09,650 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 47 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:50:09,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 410 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:50:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 07:50:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2024-11-07 07:50:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 61 states have internal predecessors, (70), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 07:50:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2024-11-07 07:50:09,683 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 141 [2024-11-07 07:50:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:50:09,684 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2024-11-07 07:50:09,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2024-11-07 07:50:09,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 07:50:09,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:50:09,685 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:50:09,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:50:09,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:50:09,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:50:09,686 INFO L85 PathProgramCache]: Analyzing trace with hash 334627230, now seen corresponding path program 1 times [2024-11-07 07:50:09,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:50:09,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274955794] [2024-11-07 07:50:09,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:50:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:50:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:50:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:50:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:50:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:50:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:50:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:50:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:50:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:50:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:50:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:50:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:50:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:50:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:50:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:50:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:50:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:50:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 07:50:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:50:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 07:50:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:50:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 07:50:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:50:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:50:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 07:50:13,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:50:13,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274955794] [2024-11-07 07:50:13,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274955794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:50:13,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:50:13,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 07:50:13,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851033266] [2024-11-07 07:50:13,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:50:13,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 07:50:13,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:50:13,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 07:50:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:50:13,442 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:16,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:50:16,365 INFO L93 Difference]: Finished difference Result 129 states and 177 transitions. [2024-11-07 07:50:16,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 07:50:16,366 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2024-11-07 07:50:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:50:16,368 INFO L225 Difference]: With dead ends: 129 [2024-11-07 07:50:16,368 INFO L226 Difference]: Without dead ends: 127 [2024-11-07 07:50:16,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:50:16,368 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 45 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:50:16,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 438 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 07:50:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-07 07:50:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2024-11-07 07:50:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.180327868852459) internal successors, (72), 62 states have internal predecessors, (72), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 07:50:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 148 transitions. [2024-11-07 07:50:16,388 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 148 transitions. Word has length 141 [2024-11-07 07:50:16,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:50:16,389 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 148 transitions. [2024-11-07 07:50:16,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 148 transitions. [2024-11-07 07:50:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 07:50:16,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:50:16,395 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:50:16,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:50:16,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:50:16,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:50:16,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1014685600, now seen corresponding path program 1 times [2024-11-07 07:50:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:50:16,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159117721] [2024-11-07 07:50:16,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:50:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:50:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:50:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:50:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:50:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:50:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:50:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:50:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:50:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:50:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:50:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:50:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:50:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:50:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:50:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:50:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:50:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:50:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 07:50:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:50:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 07:50:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:50:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 07:50:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:50:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:50:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 07:50:18,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:50:18,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159117721] [2024-11-07 07:50:18,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159117721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:50:18,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:50:18,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 07:50:18,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796185931] [2024-11-07 07:50:18,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:50:18,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 07:50:18,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:50:18,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 07:50:18,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:50:18,694 INFO L87 Difference]: Start difference. First operand 102 states and 148 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:50:22,852 INFO L93 Difference]: Finished difference Result 125 states and 173 transitions. [2024-11-07 07:50:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 07:50:22,853 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2024-11-07 07:50:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:50:22,854 INFO L225 Difference]: With dead ends: 125 [2024-11-07 07:50:22,854 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 07:50:22,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:50:22,855 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 26 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 07:50:22,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 340 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 07:50:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 07:50:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 98. [2024-11-07 07:50:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 58 states have internal predecessors, (66), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 07:50:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2024-11-07 07:50:22,866 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 142 transitions. Word has length 141 [2024-11-07 07:50:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:50:22,866 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 142 transitions. [2024-11-07 07:50:22,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 142 transitions. [2024-11-07 07:50:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 07:50:22,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:50:22,867 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:50:22,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 07:50:22,867 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:50:22,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:50:22,867 INFO L85 PathProgramCache]: Analyzing trace with hash -216406091, now seen corresponding path program 1 times [2024-11-07 07:50:22,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:50:22,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507883318] [2024-11-07 07:50:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:50:22,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:50:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:50:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:50:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:50:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:50:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:50:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:50:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:50:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:50:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:50:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:50:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:50:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:50:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:50:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:50:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:50:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:50:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 07:50:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:50:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 07:50:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:50:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 07:50:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:50:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:50:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 07:50:23,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:50:23,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507883318] [2024-11-07 07:50:23,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507883318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:50:23,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:50:23,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:50:23,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525031878] [2024-11-07 07:50:23,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:50:23,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:50:23,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:50:23,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:50:23,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:50:23,266 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:50:23,604 INFO L93 Difference]: Finished difference Result 263 states and 381 transitions. [2024-11-07 07:50:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:50:23,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2024-11-07 07:50:23,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:50:23,606 INFO L225 Difference]: With dead ends: 263 [2024-11-07 07:50:23,606 INFO L226 Difference]: Without dead ends: 168 [2024-11-07 07:50:23,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:50:23,607 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 42 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:50:23,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 263 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:50:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-07 07:50:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 150. [2024-11-07 07:50:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 85 states have (on average 1.1647058823529413) internal successors, (99), 86 states have internal predecessors, (99), 61 states have call successors, (61), 3 states have call predecessors, (61), 3 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-07 07:50:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 221 transitions. [2024-11-07 07:50:23,630 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 221 transitions. Word has length 141 [2024-11-07 07:50:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:50:23,631 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 221 transitions. [2024-11-07 07:50:23,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 221 transitions. [2024-11-07 07:50:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 07:50:23,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:50:23,632 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:50:23,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 07:50:23,632 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:50:23,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:50:23,633 INFO L85 PathProgramCache]: Analyzing trace with hash -214559049, now seen corresponding path program 1 times [2024-11-07 07:50:23,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:50:23,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647664081] [2024-11-07 07:50:23,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:50:23,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:50:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:50:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:50:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:50:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:50:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:50:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:50:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:50:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:50:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:50:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:50:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:50:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:50:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:50:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:50:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:50:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:50:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 07:50:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:50:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 07:50:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:50:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 07:50:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:50:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:50:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 07:50:25,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:50:25,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647664081] [2024-11-07 07:50:25,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647664081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:50:25,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:50:25,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 07:50:25,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940507250] [2024-11-07 07:50:25,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:50:25,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 07:50:25,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:50:25,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 07:50:25,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:50:25,956 INFO L87 Difference]: Start difference. First operand 150 states and 221 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:28,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:50:28,206 INFO L93 Difference]: Finished difference Result 172 states and 243 transitions. [2024-11-07 07:50:28,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 07:50:28,207 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2024-11-07 07:50:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:50:28,211 INFO L225 Difference]: With dead ends: 172 [2024-11-07 07:50:28,211 INFO L226 Difference]: Without dead ends: 170 [2024-11-07 07:50:28,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2024-11-07 07:50:28,212 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 61 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:50:28,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 461 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 07:50:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-07 07:50:28,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 150. [2024-11-07 07:50:28,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 85 states have (on average 1.1647058823529413) internal successors, (99), 86 states have internal predecessors, (99), 61 states have call successors, (61), 3 states have call predecessors, (61), 3 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-07 07:50:28,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 221 transitions. [2024-11-07 07:50:28,243 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 221 transitions. Word has length 141 [2024-11-07 07:50:28,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:50:28,243 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 221 transitions. [2024-11-07 07:50:28,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:28,244 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 221 transitions. [2024-11-07 07:50:28,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 07:50:28,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:50:28,245 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:50:28,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 07:50:28,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:50:28,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:50:28,246 INFO L85 PathProgramCache]: Analyzing trace with hash 867890881, now seen corresponding path program 1 times [2024-11-07 07:50:28,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:50:28,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198904766] [2024-11-07 07:50:28,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:50:28,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:50:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:50:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:50:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:50:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:50:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:50:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:50:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:50:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:50:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:50:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:50:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:50:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:50:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:50:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:50:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:50:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:50:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 07:50:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:50:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 07:50:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:50:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 07:50:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:50:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:50:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 07:50:29,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:50:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198904766] [2024-11-07 07:50:29,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198904766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:50:29,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:50:29,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 07:50:29,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468903444] [2024-11-07 07:50:29,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:50:29,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 07:50:29,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:50:29,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 07:50:29,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:50:29,822 INFO L87 Difference]: Start difference. First operand 150 states and 221 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:50:30,210 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2024-11-07 07:50:30,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 07:50:30,211 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 142 [2024-11-07 07:50:30,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:50:30,212 INFO L225 Difference]: With dead ends: 174 [2024-11-07 07:50:30,212 INFO L226 Difference]: Without dead ends: 172 [2024-11-07 07:50:30,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-07 07:50:30,213 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 56 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:50:30,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 406 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:50:30,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-07 07:50:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154. [2024-11-07 07:50:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 89 states have (on average 1.1797752808988764) internal successors, (105), 90 states have internal predecessors, (105), 61 states have call successors, (61), 3 states have call predecessors, (61), 3 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-07 07:50:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 227 transitions. [2024-11-07 07:50:30,243 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 227 transitions. Word has length 142 [2024-11-07 07:50:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:50:30,243 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 227 transitions. [2024-11-07 07:50:30,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:30,243 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 227 transitions. [2024-11-07 07:50:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 07:50:30,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:50:30,245 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:50:30,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 07:50:30,245 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:50:30,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:50:30,246 INFO L85 PathProgramCache]: Analyzing trace with hash 869737923, now seen corresponding path program 1 times [2024-11-07 07:50:30,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:50:30,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345488668] [2024-11-07 07:50:30,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:50:30,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:50:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:50:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:50:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:50:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:50:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:50:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:50:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:50:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:50:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:50:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:50:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:50:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:50:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:50:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:50:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:50:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:50:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 07:50:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:50:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 07:50:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:50:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 07:50:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:50:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:50:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 07:50:32,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:50:32,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345488668] [2024-11-07 07:50:32,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345488668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:50:32,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:50:32,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 07:50:32,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617027507] [2024-11-07 07:50:32,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:50:32,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 07:50:32,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:50:32,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 07:50:32,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:50:32,093 INFO L87 Difference]: Start difference. First operand 154 states and 227 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:50:32,842 INFO L93 Difference]: Finished difference Result 171 states and 243 transitions. [2024-11-07 07:50:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 07:50:32,843 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 142 [2024-11-07 07:50:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:50:32,844 INFO L225 Difference]: With dead ends: 171 [2024-11-07 07:50:32,844 INFO L226 Difference]: Without dead ends: 169 [2024-11-07 07:50:32,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-11-07 07:50:32,845 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 54 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:50:32,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 435 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:50:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-07 07:50:32,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2024-11-07 07:50:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 89 states have (on average 1.1797752808988764) internal successors, (105), 90 states have internal predecessors, (105), 61 states have call successors, (61), 3 states have call predecessors, (61), 3 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-07 07:50:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 227 transitions. [2024-11-07 07:50:32,859 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 227 transitions. Word has length 142 [2024-11-07 07:50:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:50:32,860 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 227 transitions. [2024-11-07 07:50:32,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 227 transitions. [2024-11-07 07:50:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 07:50:32,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:50:32,861 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:50:32,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 07:50:32,861 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:50:32,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:50:32,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1549796293, now seen corresponding path program 1 times [2024-11-07 07:50:32,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:50:32,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554010042] [2024-11-07 07:50:32,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:50:32,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:50:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:50:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:50:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:50:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:50:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:50:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:50:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:50:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:50:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:50:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:50:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:50:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:50:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:50:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:50:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:50:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:50:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 07:50:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:50:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 07:50:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:50:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 07:50:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:50:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:50:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 07:50:38,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:50:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554010042] [2024-11-07 07:50:38,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554010042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:50:38,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:50:38,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 07:50:38,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114880004] [2024-11-07 07:50:38,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:50:38,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 07:50:38,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:50:38,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 07:50:38,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-07 07:50:38,871 INFO L87 Difference]: Start difference. First operand 154 states and 227 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:50:42,279 INFO L93 Difference]: Finished difference Result 176 states and 249 transitions. [2024-11-07 07:50:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 07:50:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 142 [2024-11-07 07:50:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:50:42,280 INFO L225 Difference]: With dead ends: 176 [2024-11-07 07:50:42,281 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 07:50:42,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2024-11-07 07:50:42,282 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 59 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:50:42,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 452 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 07:50:42,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 07:50:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2024-11-07 07:50:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 89 states have (on average 1.1797752808988764) internal successors, (105), 90 states have internal predecessors, (105), 61 states have call successors, (61), 3 states have call predecessors, (61), 3 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-07 07:50:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 227 transitions. [2024-11-07 07:50:42,297 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 227 transitions. Word has length 142 [2024-11-07 07:50:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:50:42,298 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 227 transitions. [2024-11-07 07:50:42,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 07:50:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 227 transitions. [2024-11-07 07:50:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-07 07:50:42,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:50:42,300 INFO L215 NwaCegarLoop]: trace histogram [46, 46, 46, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:50:42,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 07:50:42,300 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:50:42,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:50:42,301 INFO L85 PathProgramCache]: Analyzing trace with hash -429005535, now seen corresponding path program 1 times [2024-11-07 07:50:42,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:50:42,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754871150] [2024-11-07 07:50:42,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:50:42,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:50:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:50:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:50:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:50:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:50:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:50:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:50:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:50:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:50:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:50:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:50:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:50:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:50:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:50:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:50:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:50:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:50:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 07:50:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:50:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 07:50:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:50:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 07:50:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:50:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:50:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 07:50:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:50:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:50:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:50:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:50:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:50:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:50:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:50:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:50:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-07 07:50:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:50:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:50:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-07 07:50:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-07 07:50:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-07 07:50:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-07 07:50:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-07 07:50:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-07 07:50:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 07:50:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-07 07:50:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-07 07:50:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-07 07:50:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-07 07:50:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:43,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2024-11-07 07:50:43,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:50:43,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754871150] [2024-11-07 07:50:43,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754871150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:50:43,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015253082] [2024-11-07 07:50:43,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:50:43,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:50:43,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:50:43,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:50:43,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 07:50:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:50:44,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 07:50:44,140 INFO L278 TraceCheckSpWp]: Computing forward predicates...