./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'd32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:02:10,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:02:10,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:02:10,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:02:10,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:02:10,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:02:10,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:02:10,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:02:10,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:02:10,464 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:02:10,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:02:10,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:02:10,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:02:10,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:02:10,465 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:02:10,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:02:10,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:02:10,466 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:02:10,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:02:10,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:02:10,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:02:10,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:02:10,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:02:10,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:02:10,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:02:10,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:02:10,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:02:10,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:02:10,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:02:10,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:02:10,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:02:10,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:02:10,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:02:10,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:02:10,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:02:10,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:02:10,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:02:10,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:02:10,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:02:10,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:02:10,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:02:10,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:02:10,469 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 -> d32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7 [2024-11-07 04:02:10,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:02:10,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:02:10,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:02:10,737 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:02:10,738 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:02:10,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2024-11-07 04:02:11,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:02:12,161 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:02:12,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2024-11-07 04:02:12,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36131b97e/6baeeb1f20224857b3226bfbb19193bb/FLAG44174e8ab [2024-11-07 04:02:12,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36131b97e/6baeeb1f20224857b3226bfbb19193bb [2024-11-07 04:02:12,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:02:12,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:02:12,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:02:12,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:02:12,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:02:12,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:02:12" (1/1) ... [2024-11-07 04:02:12,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db15f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12, skipping insertion in model container [2024-11-07 04:02:12,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:02:12" (1/1) ... [2024-11-07 04:02:12,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:02:12,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i[919,932] [2024-11-07 04:02:12,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:02:12,347 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:02:12,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i[919,932] [2024-11-07 04:02:12,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:02:12,384 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:02:12,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12 WrapperNode [2024-11-07 04:02:12,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:02:12,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:02:12,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:02:12,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:02:12,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12" (1/1) ... [2024-11-07 04:02:12,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12" (1/1) ... [2024-11-07 04:02:12,442 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-07 04:02:12,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:02:12,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:02:12,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:02:12,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:02:12,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12" (1/1) ... [2024-11-07 04:02:12,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12" (1/1) ... [2024-11-07 04:02:12,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12" (1/1) ... [2024-11-07 04:02:12,477 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 04:02:12,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12" (1/1) ... [2024-11-07 04:02:12,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12" (1/1) ... [2024-11-07 04:02:12,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12" (1/1) ... [2024-11-07 04:02:12,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12" (1/1) ... [2024-11-07 04:02:12,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12" (1/1) ... [2024-11-07 04:02:12,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12" (1/1) ... [2024-11-07 04:02:12,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:02:12,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:02:12,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:02:12,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:02:12,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12" (1/1) ... [2024-11-07 04:02:12,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:02:12,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:02:12,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 04:02:12,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 04:02:12,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:02:12,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:02:12,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:02:12,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:02:12,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:02:12,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:02:12,618 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:02:12,620 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:02:12,958 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 04:02:12,959 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:02:12,966 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:02:12,966 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:02:12,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:02:12 BoogieIcfgContainer [2024-11-07 04:02:12,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:02:12,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:02:12,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:02:12,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:02:12,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:02:12" (1/3) ... [2024-11-07 04:02:12,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535fe146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:02:12, skipping insertion in model container [2024-11-07 04:02:12,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:02:12" (2/3) ... [2024-11-07 04:02:12,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535fe146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:02:12, skipping insertion in model container [2024-11-07 04:02:12,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:02:12" (3/3) ... [2024-11-07 04:02:12,975 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-86.i [2024-11-07 04:02:12,986 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:02:12,987 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:02:13,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:02:13,052 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;@14d9fc2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:02:13,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:02:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 04:02:13,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 04:02:13,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:02:13,066 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:02:13,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:02:13,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:02:13,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2100497442, now seen corresponding path program 1 times [2024-11-07 04:02:13,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:02:13,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589344158] [2024-11-07 04:02:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:02:13,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:02:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:02:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:02:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:02:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:02:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:02:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:02:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:02:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:02:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:02:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:02:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:02:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:02:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:02:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:02:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:02:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:02:13,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:02:13,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589344158] [2024-11-07 04:02:13,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589344158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:02:13,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:02:13,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:02:13,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273554692] [2024-11-07 04:02:13,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:02:13,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:02:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:02:13,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:02:13,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:02:13,417 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 04:02:13,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:02:13,436 INFO L93 Difference]: Finished difference Result 97 states and 167 transitions. [2024-11-07 04:02:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:02:13,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-11-07 04:02:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:02:13,444 INFO L225 Difference]: With dead ends: 97 [2024-11-07 04:02:13,444 INFO L226 Difference]: Without dead ends: 48 [2024-11-07 04:02:13,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:02:13,450 INFO L432 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:02:13,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:02:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-07 04:02:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-07 04:02:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 04:02:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-11-07 04:02:13,486 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 98 [2024-11-07 04:02:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:02:13,486 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-11-07 04:02:13,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 04:02:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-11-07 04:02:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 04:02:13,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:02:13,490 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:02:13,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:02:13,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:02:13,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:02:13,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1585339296, now seen corresponding path program 1 times [2024-11-07 04:02:13,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:02:13,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800449603] [2024-11-07 04:02:13,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:02:13,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:02:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:02:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:02:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:02:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:02:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:02:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:02:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:02:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:02:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:02:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:02:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:02:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:02:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:02:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:02:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:02:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:02:13,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:02:13,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800449603] [2024-11-07 04:02:13,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800449603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:02:13,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:02:13,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 04:02:13,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127135471] [2024-11-07 04:02:13,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:02:13,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:02:13,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:02:13,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:02:13,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:02:13,950 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:02:14,088 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2024-11-07 04:02:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:02:14,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-07 04:02:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:02:14,090 INFO L225 Difference]: With dead ends: 139 [2024-11-07 04:02:14,091 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 04:02:14,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 04:02:14,093 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 86 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:02:14,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 191 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:02:14,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 04:02:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2024-11-07 04:02:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 04:02:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2024-11-07 04:02:14,118 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 98 [2024-11-07 04:02:14,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:02:14,120 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2024-11-07 04:02:14,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:14,121 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2024-11-07 04:02:14,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 04:02:14,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:02:14,121 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:02:14,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:02:14,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:02:14,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:02:14,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2029569630, now seen corresponding path program 1 times [2024-11-07 04:02:14,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:02:14,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508576402] [2024-11-07 04:02:14,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:02:14,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:02:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:02:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:02:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:02:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:02:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:02:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:02:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:02:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:02:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:02:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:02:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:02:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:02:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:02:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:02:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:02:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:17,421 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:02:17,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:02:17,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508576402] [2024-11-07 04:02:17,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508576402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:02:17,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:02:17,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 04:02:17,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091388708] [2024-11-07 04:02:17,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:02:17,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 04:02:17,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:02:17,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 04:02:17,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-07 04:02:17,423 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:18,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:02:18,480 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2024-11-07 04:02:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 04:02:18,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-07 04:02:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:02:18,484 INFO L225 Difference]: With dead ends: 185 [2024-11-07 04:02:18,486 INFO L226 Difference]: Without dead ends: 140 [2024-11-07 04:02:18,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-07 04:02:18,487 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 04:02:18,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 237 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 04:02:18,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-07 04:02:18,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 97. [2024-11-07 04:02:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 04:02:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-11-07 04:02:18,510 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 98 [2024-11-07 04:02:18,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:02:18,510 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-11-07 04:02:18,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:18,510 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-11-07 04:02:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 04:02:18,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:02:18,511 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:02:18,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:02:18,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:02:18,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:02:18,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1872370656, now seen corresponding path program 1 times [2024-11-07 04:02:18,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:02:18,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812802566] [2024-11-07 04:02:18,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:02:18,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:02:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:02:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:02:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:02:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:02:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:02:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:02:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:02:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:02:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:02:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:02:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:02:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:02:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:02:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:02:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:02:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:02:18,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:02:18,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812802566] [2024-11-07 04:02:18,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812802566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:02:18,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:02:18,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:02:18,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303542668] [2024-11-07 04:02:18,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:02:18,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:02:18,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:02:18,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:02:18,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:02:18,575 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:02:18,603 INFO L93 Difference]: Finished difference Result 204 states and 303 transitions. [2024-11-07 04:02:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:02:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-11-07 04:02:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:02:18,605 INFO L225 Difference]: With dead ends: 204 [2024-11-07 04:02:18,605 INFO L226 Difference]: Without dead ends: 143 [2024-11-07 04:02:18,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:02:18,606 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:02:18,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 139 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:02:18,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-07 04:02:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-11-07 04:02:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 92 states have internal predecessors, (118), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 04:02:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2024-11-07 04:02:18,618 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 98 [2024-11-07 04:02:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:02:18,619 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2024-11-07 04:02:18,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2024-11-07 04:02:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 04:02:18,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:02:18,620 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:02:18,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:02:18,620 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:02:18,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:02:18,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1561352705, now seen corresponding path program 1 times [2024-11-07 04:02:18,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:02:18,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664772153] [2024-11-07 04:02:18,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:02:18,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:02:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:02:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:02:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:02:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:02:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:02:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:02:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:02:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:02:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:02:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:02:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:02:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:02:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:02:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:02:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:02:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:02:25,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:02:25,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664772153] [2024-11-07 04:02:25,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664772153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:02:25,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:02:25,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 04:02:25,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290574388] [2024-11-07 04:02:25,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:02:25,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 04:02:25,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:02:25,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 04:02:25,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:02:25,707 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:02:31,951 INFO L93 Difference]: Finished difference Result 184 states and 256 transitions. [2024-11-07 04:02:31,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 04:02:31,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-07 04:02:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:02:31,955 INFO L225 Difference]: With dead ends: 184 [2024-11-07 04:02:31,955 INFO L226 Difference]: Without dead ends: 182 [2024-11-07 04:02:31,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=164, Invalid=298, Unknown=0, NotChecked=0, Total=462 [2024-11-07 04:02:31,957 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 96 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 04:02:31,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 328 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 04:02:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-07 04:02:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2024-11-07 04:02:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.2795698924731183) internal successors, (119), 93 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 04:02:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2024-11-07 04:02:31,979 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 99 [2024-11-07 04:02:31,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:02:31,979 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2024-11-07 04:02:31,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2024-11-07 04:02:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 04:02:31,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:02:31,982 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:02:31,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 04:02:31,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:02:31,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:02:31,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1134999740, now seen corresponding path program 1 times [2024-11-07 04:02:31,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:02:31,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147318187] [2024-11-07 04:02:31,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:02:31,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:02:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:02:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:02:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:02:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:02:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:02:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:02:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:02:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:02:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:02:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:02:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:02:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:02:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:02:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:02:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:02:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:02:34,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:02:34,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147318187] [2024-11-07 04:02:34,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147318187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:02:34,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:02:34,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 04:02:34,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889466622] [2024-11-07 04:02:34,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:02:34,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 04:02:34,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:02:34,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 04:02:34,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:02:34,738 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:02:36,473 INFO L93 Difference]: Finished difference Result 189 states and 261 transitions. [2024-11-07 04:02:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 04:02:36,474 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-07 04:02:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:02:36,475 INFO L225 Difference]: With dead ends: 189 [2024-11-07 04:02:36,475 INFO L226 Difference]: Without dead ends: 187 [2024-11-07 04:02:36,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2024-11-07 04:02:36,476 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 77 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 04:02:36,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 270 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 04:02:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-07 04:02:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 144. [2024-11-07 04:02:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 95 states have internal predecessors, (122), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 04:02:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 212 transitions. [2024-11-07 04:02:36,488 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 212 transitions. Word has length 99 [2024-11-07 04:02:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:02:36,489 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 212 transitions. [2024-11-07 04:02:36,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 212 transitions. [2024-11-07 04:02:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 04:02:36,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:02:36,490 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:02:36,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 04:02:36,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:02:36,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:02:36,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1483073031, now seen corresponding path program 1 times [2024-11-07 04:02:36,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:02:36,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141589465] [2024-11-07 04:02:36,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:02:36,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:02:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:02:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:02:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:02:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:02:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:02:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:02:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:02:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:02:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:02:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:02:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:02:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:02:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:02:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:02:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:02:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:02:41,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:02:41,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141589465] [2024-11-07 04:02:41,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141589465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:02:41,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:02:41,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 04:02:41,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89434665] [2024-11-07 04:02:41,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:02:41,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 04:02:41,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:02:41,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 04:02:41,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:02:41,881 INFO L87 Difference]: Start difference. First operand 144 states and 212 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:02:43,850 INFO L93 Difference]: Finished difference Result 197 states and 273 transitions. [2024-11-07 04:02:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 04:02:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-07 04:02:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:02:43,852 INFO L225 Difference]: With dead ends: 197 [2024-11-07 04:02:43,852 INFO L226 Difference]: Without dead ends: 195 [2024-11-07 04:02:43,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-07 04:02:43,853 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 92 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:02:43,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 266 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 04:02:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-07 04:02:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 154. [2024-11-07 04:02:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 04:02:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 226 transitions. [2024-11-07 04:02:43,867 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 226 transitions. Word has length 99 [2024-11-07 04:02:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:02:43,867 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 226 transitions. [2024-11-07 04:02:43,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 226 transitions. [2024-11-07 04:02:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 04:02:43,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:02:43,872 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:02:43,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 04:02:43,872 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:02:43,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:02:43,873 INFO L85 PathProgramCache]: Analyzing trace with hash -726911460, now seen corresponding path program 1 times [2024-11-07 04:02:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:02:43,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248785805] [2024-11-07 04:02:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:02:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:02:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:02:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:02:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:02:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:02:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:02:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:02:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:02:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:02:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:02:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:02:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:02:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:02:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:02:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:02:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:02:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:02:43,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:02:43,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248785805] [2024-11-07 04:02:43,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248785805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:02:43,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:02:43,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:02:43,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465311669] [2024-11-07 04:02:43,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:02:43,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:02:43,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:02:43,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:02:43,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:02:43,960 INFO L87 Difference]: Start difference. First operand 154 states and 226 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:02:44,031 INFO L93 Difference]: Finished difference Result 348 states and 505 transitions. [2024-11-07 04:02:44,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:02:44,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-07 04:02:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:02:44,035 INFO L225 Difference]: With dead ends: 348 [2024-11-07 04:02:44,036 INFO L226 Difference]: Without dead ends: 231 [2024-11-07 04:02:44,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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 04:02:44,037 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 63 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:02:44,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 210 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:02:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-07 04:02:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 205. [2024-11-07 04:02:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 140 states have (on average 1.2857142857142858) internal successors, (180), 140 states have internal predecessors, (180), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 04:02:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 300 transitions. [2024-11-07 04:02:44,058 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 300 transitions. Word has length 99 [2024-11-07 04:02:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:02:44,059 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 300 transitions. [2024-11-07 04:02:44,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 300 transitions. [2024-11-07 04:02:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 04:02:44,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:02:44,060 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:02:44,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 04:02:44,061 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:02:44,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:02:44,061 INFO L85 PathProgramCache]: Analyzing trace with hash -771751777, now seen corresponding path program 1 times [2024-11-07 04:02:44,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:02:44,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831275859] [2024-11-07 04:02:44,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:02:44,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:02:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:02:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:02:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:02:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:02:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:02:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:02:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:02:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:02:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:02:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:02:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:02:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:02:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:02:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:02:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:02:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:02:46,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:02:46,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831275859] [2024-11-07 04:02:46,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831275859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:02:46,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:02:46,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 04:02:46,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28396994] [2024-11-07 04:02:46,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:02:46,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 04:02:46,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:02:46,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 04:02:46,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-07 04:02:46,691 INFO L87 Difference]: Start difference. First operand 205 states and 300 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 04:02:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:02:49,232 INFO L93 Difference]: Finished difference Result 253 states and 355 transitions. [2024-11-07 04:02:49,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 04:02:49,234 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 100 [2024-11-07 04:02:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:02:49,236 INFO L225 Difference]: With dead ends: 253 [2024-11-07 04:02:49,236 INFO L226 Difference]: Without dead ends: 251 [2024-11-07 04:02:49,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2024-11-07 04:02:49,237 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 196 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 04:02:49,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 318 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 04:02:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-07 04:02:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 204. [2024-11-07 04:02:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 04:02:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 298 transitions. [2024-11-07 04:02:49,265 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 298 transitions. Word has length 100 [2024-11-07 04:02:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:02:49,266 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 298 transitions. [2024-11-07 04:02:49,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 04:02:49,267 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 298 transitions. [2024-11-07 04:02:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 04:02:49,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:02:49,268 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:02:49,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 04:02:49,268 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:02:49,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:02:49,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1214027458, now seen corresponding path program 1 times [2024-11-07 04:02:49,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:02:49,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148366708] [2024-11-07 04:02:49,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:02:49,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:02:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:02:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:02:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:02:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:02:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:02:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:02:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:02:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:02:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:02:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:02:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:02:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:02:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:02:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:02:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:02:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:02:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:02:52,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:02:52,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148366708] [2024-11-07 04:02:52,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148366708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:02:52,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:02:52,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 04:02:52,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419272403] [2024-11-07 04:02:52,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:02:52,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 04:02:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:02:52,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 04:02:52,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-07 04:02:52,743 INFO L87 Difference]: Start difference. First operand 204 states and 298 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:56,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:02:56,530 INFO L93 Difference]: Finished difference Result 273 states and 378 transitions. [2024-11-07 04:02:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 04:02:56,531 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-11-07 04:02:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:02:56,532 INFO L225 Difference]: With dead ends: 273 [2024-11-07 04:02:56,532 INFO L226 Difference]: Without dead ends: 271 [2024-11-07 04:02:56,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2024-11-07 04:02:56,533 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 75 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:02:56,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 329 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 04:02:56,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-07 04:02:56,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 206. [2024-11-07 04:02:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 141 states have internal predecessors, (180), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 04:02:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 300 transitions. [2024-11-07 04:02:56,547 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 300 transitions. Word has length 100 [2024-11-07 04:02:56,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:02:56,547 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 300 transitions. [2024-11-07 04:02:56,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:02:56,547 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 300 transitions. [2024-11-07 04:02:56,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 04:02:56,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:02:56,548 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:02:56,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 04:02:56,548 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:02:56,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:02:56,549 INFO L85 PathProgramCache]: Analyzing trace with hash 382740351, now seen corresponding path program 1 times [2024-11-07 04:02:56,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:02:56,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484327071] [2024-11-07 04:02:56,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:02:56,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:02:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:03:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:03:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:03:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:03:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:03:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:03:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:03:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:03:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:03:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:03:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:03:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:03:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:03:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:03:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:03:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:00,153 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:03:00,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:03:00,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484327071] [2024-11-07 04:03:00,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484327071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:03:00,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:03:00,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 04:03:00,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994127839] [2024-11-07 04:03:00,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:03:00,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 04:03:00,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:03:00,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 04:03:00,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-07 04:03:00,159 INFO L87 Difference]: Start difference. First operand 206 states and 300 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 04:03:04,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:03:04,449 INFO L93 Difference]: Finished difference Result 305 states and 417 transitions. [2024-11-07 04:03:04,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 04:03:04,450 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 100 [2024-11-07 04:03:04,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:03:04,457 INFO L225 Difference]: With dead ends: 305 [2024-11-07 04:03:04,458 INFO L226 Difference]: Without dead ends: 303 [2024-11-07 04:03:04,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2024-11-07 04:03:04,462 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 247 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:03:04,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 238 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 04:03:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-07 04:03:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 214. [2024-11-07 04:03:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 149 states have internal predecessors, (192), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 04:03:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 312 transitions. [2024-11-07 04:03:04,479 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 312 transitions. Word has length 100 [2024-11-07 04:03:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:03:04,479 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 312 transitions. [2024-11-07 04:03:04,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 04:03:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 312 transitions. [2024-11-07 04:03:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 04:03:04,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:03:04,480 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:03:04,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 04:03:04,480 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:03:04,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:03:04,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1062798721, now seen corresponding path program 1 times [2024-11-07 04:03:04,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:03:04,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816205903] [2024-11-07 04:03:04,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:03:04,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:03:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:03:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:03:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:03:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:03:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:03:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:03:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:03:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:03:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:03:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:03:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:03:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:03:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:03:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:03:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:03:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:03:10,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:03:10,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816205903] [2024-11-07 04:03:10,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816205903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:03:10,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:03:10,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 04:03:10,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448137391] [2024-11-07 04:03:10,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:03:10,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 04:03:10,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:03:10,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 04:03:10,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-07 04:03:10,183 INFO L87 Difference]: Start difference. First operand 214 states and 312 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 04:03:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:03:17,511 INFO L93 Difference]: Finished difference Result 287 states and 396 transitions. [2024-11-07 04:03:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 04:03:17,512 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 100 [2024-11-07 04:03:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:03:17,514 INFO L225 Difference]: With dead ends: 287 [2024-11-07 04:03:17,515 INFO L226 Difference]: Without dead ends: 285 [2024-11-07 04:03:17,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2024-11-07 04:03:17,516 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 191 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 04:03:17,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 233 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 04:03:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-07 04:03:17,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 210. [2024-11-07 04:03:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 04:03:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 306 transitions. [2024-11-07 04:03:17,537 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 306 transitions. Word has length 100 [2024-11-07 04:03:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:03:17,538 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 306 transitions. [2024-11-07 04:03:17,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 04:03:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 306 transitions. [2024-11-07 04:03:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 04:03:17,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:03:17,539 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:03:17,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 04:03:17,539 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:03:17,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:03:17,539 INFO L85 PathProgramCache]: Analyzing trace with hash -826031221, now seen corresponding path program 1 times [2024-11-07 04:03:17,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:03:17,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208237552] [2024-11-07 04:03:17,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:03:17,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:03:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:03:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:03:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:03:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:03:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:03:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:03:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:03:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:03:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:03:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:03:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:03:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:03:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:03:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:03:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:03:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:03:23,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:03:23,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208237552] [2024-11-07 04:03:23,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208237552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:03:23,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:03:23,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 04:03:23,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21105103] [2024-11-07 04:03:23,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:03:23,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 04:03:23,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:03:23,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 04:03:23,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-07 04:03:23,790 INFO L87 Difference]: Start difference. First operand 210 states and 306 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:03:27,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:03:27,044 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2024-11-07 04:03:27,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 04:03:27,045 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-11-07 04:03:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:03:27,047 INFO L225 Difference]: With dead ends: 306 [2024-11-07 04:03:27,050 INFO L226 Difference]: Without dead ends: 304 [2024-11-07 04:03:27,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-07 04:03:27,051 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 82 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:03:27,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 324 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 04:03:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-07 04:03:27,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 220. [2024-11-07 04:03:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 155 states have (on average 1.303225806451613) internal successors, (202), 155 states have internal predecessors, (202), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 04:03:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 322 transitions. [2024-11-07 04:03:27,082 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 322 transitions. Word has length 100 [2024-11-07 04:03:27,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:03:27,082 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 322 transitions. [2024-11-07 04:03:27,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 04:03:27,083 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 322 transitions. [2024-11-07 04:03:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 04:03:27,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:03:27,088 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:03:27,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 04:03:27,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:03:27,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:03:27,089 INFO L85 PathProgramCache]: Analyzing trace with hash -964602170, now seen corresponding path program 1 times [2024-11-07 04:03:27,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:03:27,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946682543] [2024-11-07 04:03:27,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:03:27,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:03:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:03:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:03:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:03:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:03:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:03:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:03:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:03:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:03:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:03:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:03:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:03:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:03:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:03:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:03:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:03:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:03:31,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:03:31,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946682543] [2024-11-07 04:03:31,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946682543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:03:31,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:03:31,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 04:03:31,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197852584] [2024-11-07 04:03:31,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:03:31,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 04:03:31,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:03:31,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 04:03:31,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-07 04:03:31,786 INFO L87 Difference]: Start difference. First operand 220 states and 322 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 04:03:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:03:37,292 INFO L93 Difference]: Finished difference Result 289 states and 401 transitions. [2024-11-07 04:03:37,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 04:03:37,293 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 101 [2024-11-07 04:03:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:03:37,294 INFO L225 Difference]: With dead ends: 289 [2024-11-07 04:03:37,294 INFO L226 Difference]: Without dead ends: 287 [2024-11-07 04:03:37,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=210, Invalid=440, Unknown=0, NotChecked=0, Total=650 [2024-11-07 04:03:37,295 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 161 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:03:37,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 298 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 04:03:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-07 04:03:37,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 220. [2024-11-07 04:03:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 155 states have (on average 1.303225806451613) internal successors, (202), 155 states have internal predecessors, (202), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 04:03:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 322 transitions. [2024-11-07 04:03:37,330 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 322 transitions. Word has length 101 [2024-11-07 04:03:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:03:37,330 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 322 transitions. [2024-11-07 04:03:37,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-07 04:03:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 322 transitions. [2024-11-07 04:03:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 04:03:37,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:03:37,332 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:03:37,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 04:03:37,332 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:03:37,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:03:37,333 INFO L85 PathProgramCache]: Analyzing trace with hash 218184762, now seen corresponding path program 1 times [2024-11-07 04:03:37,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:03:37,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533747440] [2024-11-07 04:03:37,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:03:37,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:03:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:03:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:03:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:03:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:03:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:03:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:03:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:03:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:03:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:03:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:03:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:03:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:03:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:03:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:03:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:03:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:03:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 04:03:44,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:03:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533747440] [2024-11-07 04:03:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533747440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:03:44,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:03:44,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 04:03:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662078345] [2024-11-07 04:03:44,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:03:44,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 04:03:44,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:03:44,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 04:03:44,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-07 04:03:44,792 INFO L87 Difference]: Start difference. First operand 220 states and 322 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)